ar X iv : 1 10 7 . 20 88 v 1 [ cs . A I ] 1 1 Ju l 2 01 1 Advancing Multi - Context Systems by Inconsistency Management
نویسنده
چکیده
Multi-Context Systems are an expressive formalism to model (possibly) non-monotonic information exchange between heterogeneous knowledge bases. Such information exchange, however, often comes with unforseen side-effects leading to violation of constraints, making the system inconsistent, and thus unusable. Although there are many approaches to assess and repair a single inconsistent knowledge base, the heterogeneous nature of Multi-Context Systems poses problems which have not yet been addressed in a satisfying way: How to identify and explain a inconsistency that spreads over multiple knowledge bases with different logical formalisms (e.g., logic programs and ontologies)? What are the causes of inconsistency if inference/information exchange is nonmonotonic (e.g., absent information as cause)? How to deal with inconsistency if access to knowledge bases is restricted (e.g., companies exchange information, but do not allow arbitrary modifications to their knowledge bases)? Many traditional approaches solely aim for a consistent system, but automatic removal of inconsistency is not always desireable. Therefore a human operator has to be supported in finding the erroneous parts contributing to the inconsistency. In my thesis those issues will be adressed mainly from a foundational perspective, while our research project also provides algorithms and prototype implementations.
منابع مشابه
ar X iv : 1 10 6 . 26 52 v 1 [ cs . A I ] 1 4 Ju n 20 11 23 Actual Causation and the Art of Modeling
متن کامل
CALT - 2017 - 040 ar X iv : 1 70 7 . 04 01 7 v 1 [ he p - th ] 1 3 Ju l 2 01 7
We introduce and explore the relation between knot invariants and quiver representation theory, which follows from the identification of quiver quantum mechanics in D-brane systems representing knots. We identify various structural properties of quivers associated to knots, and identify such quivers explicitly in many examples, including some infinite families of knots, all knots up to 6 crossi...
متن کاملar X iv : 1 30 7 . 39 13 v 1 [ cs . C C ] 1 5 Ju l 2 01 3 PEBBLE GAMES , PROOF COMPLEXITY , AND TIME - SPACE TRADE - OFFS
Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space...
متن کاملar X iv : 1 20 1 . 61 81 v 2 [ cs . N I ] 1 2 Ju l 2 01 2 Contextual Multi - armed Bandits for the Prevention of Spam in VoIP Networks Technical Report
In this paper we argue that contextual multi-armed bandit algorithms could open avenues for designing self-learning security modules for computer networks and related tasks. The paper has two contributions: a conceptual one and an algorithmical one. The conceptual contribution is to formulate – as an example – the real-world problem of preventing SPIT (Spam in VoIP networks), which is currently...
متن کاملApproximate Generalized Matching: $f$-Factors and $f$-Edge Covers
In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include O (m)-time algorithms for (1 − )maximum weight f -factor and (1+ )-approximate minimum weight f -edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in O(m √ f(V )) time. The technic...
متن کامل